#include <iostream>

#include "hashTable.h"

#include "Unordered_map.hpp"
#include "Unordered_set.hpp"

using namespace std;

// void test1() {
//   HashBucket::unordered_set<int> s1;
//   int a[] = {1, 4, 23, 12, 15, 90, 66, 8};
//   for (auto e : a) {
//     // cout << s1.Insert(e) << endl;

//   }
// }
void unordered_Test1() {
  int arr[] = {1, 1, 4, 5, 2, 3, 3, 6, 4, 4};

  HashBucket::unordered_map<int, int> m1;

  for (auto &it : arr) {
    // m1[it];
    m1.Insert({it, it});
  }

  for (auto &it : m1) {
    cout << it.first << " : " << it.second << endl;
  }
}

//

void test2() {
  HashBucket::unordered_set<int> s1;
  int arr[] = {1, 4, 23, 12, 55, 67, 12};
  for (auto e : arr) {
    s1.Insert(e);
  }
  for(auto &it : s1){
    cout << it << " ";
  }
  cout << endl;
}
int main() {
  //   test1();
  unordered_Test1();

  test2();

  return 0;
}
